The Input/Output Complexity of Sparse Matrix Multiplication
نویسندگان
چکیده
We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (STOC ’81) it was shown that to compute a product of dense U×U matrices, Θ (
منابع مشابه
A Soft-Input Soft-Output Target Detection Algorithm for Passive Radar
Abstract: This paper proposes a novel scheme for multi-static passive radar processing, based on soft-input soft-output processing and Bayesian sparse estimation. In this scheme, each receiver estimates the probability of target presence based on its received signal and the prior information received from a central processor. The resulting posterior target probabilities are transmitted to the c...
متن کاملA Comparative Evaluation of the Sub-sectors' Linkages of Iran's Economy in the Last Five Decades: The Hybrid Approach of Input-Output Tables and Cross-Impact Matrix Multiplication Applied to Classification (MICMAC)
In this paper, the hybrid modeling of Input-Output framework and MICMAC technique have been used to evaluates the inter-sectoral interactions between all sectors and activities of Iran’s economy based on the statistics aggregate Input-Output tables for five periods from 1973 to 2011. The main 15 sectors are elaborated and the results of the interactions were used to extract sectoral prioriti...
متن کاملConstrained Fine-Grain Parallel Sparse Matrix Distribution
We consider how to distribute sparse matrices among processors to reduce communication cost in parallel sparse matrix computations, in particular, sparse matrix-vector multiplication. We allow 2d distributions, where the distribution (partitioning) is not constrained to just rows or columns. The fine-grain model is a 2d distribution introduced in [2] where nonzeros can be assigned to processors...
متن کاملDesign Principles for Sparse Matrix Multiplication on the GPU
We implement two novel algorithms for sparse-matrix densematrix multiplication (SpMM) on the GPU. Our algorithms expect the sparse input in the popular compressed-sparse-row (CSR) format and thus do not require expensive format conversion. While previous SpMM work concentrates on thread-level parallelism, we additionally focus on latency hiding with instruction-level parallelism and load-balanc...
متن کاملSimultaneous Input and Output Matrix Partitioning for Outer-Product-Parallel Sparse Matrix-Matrix Multiplication
For outer-product–parallel sparse matrix-matrix multiplication (SpGEMM) of the form C=A×B, we propose three hypergraph models that achieve simultaneous partitioning of input and output matrices without any replication of input data. All three hypergraph models perform conformable one-dimensional (1D) columnwise and 1D rowwise partitioning of the input matrices A and B, respectively. The first h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014